High-Quality Shared-Memory Graph Partitioning
نویسندگان
چکیده
منابع مشابه
High-Quality Shared-Memory Graph Partitioning
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitions have problems in this context since they often show a negative trade-off between speed and q...
متن کاملHigh Quality Graph Partitioning
We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on max-flow and min-cut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred...
متن کاملEdge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be leveraged to substantially improve the efficiency of externalmemory graph search. This paper introduces a technique, called edge partitioning, which exploits a form of local structure that has not been considered in pr...
متن کاملScalable, Shared Memory Parallel Graph Coloring Heuristics
Finding a good graph coloring quickly is often a crucial phase in the development of eecient, parallel algorithms for many scientiic and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost line...
متن کاملGraph reduction on shared-memory multiprocessors
reduction machine. The next major efficiency improvement was to compile the program into application specific combinators, which are called super combinator [Hughes82]. This idea has been successfully implemented in the G-machine [Johnsson84, Augustsson84]. A program is first transformed through lambda lifting into a set of super combinators, which are then compiled into native assembly code fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2020
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2020.3001645